On Languages Accepted by P/T Systems Composed of joins

Recently, some studies linked the computational power of abstract computing systems based on multiset rewriting to models of Petri nets and the computation power of these nets to their topology. In turn, the computational power of these abstract computing devices can be understood by just looking at their topology, that is, information flow. Here we continue this line of research introducing J languages and proving that they can be accepted by place/transition systems whose underlying net is composed only of joins. Moreover, we investigate how J languages relate to other families of formal languages. In particular, we show that every J language can be accepted by a log n space-bounded non-deterministic Turing machine with a one-way read-only input. We also show that every J language has a semilinear Parikh map and that J languages and context-free languages (CFLs) are incomparable

Analisis Kerugian Dan Pemetaan Sebaran Serangan Rayap Pada Bangunan SD Negeri Di Bagian Barat Kota Pekanbaru

As one of the common facilities, Elementary Schools are very important and should be maintained in order to remain in good condition. Termites attacked on the building at the moment was a very big deal considering that the higher the intensity of their attacked and expanded so that the value of lost due to termite attacked tend to increase from year to year. This study aimed to get the value of economic losses termite attacked and get a map of the distribution of species of termites in the Elementary School building in the western of Pekanbaru. The research was conducted from July 2014 until August 2014 by using purposive sampling method 15% of the total number of Elementary Schools in the city of Pekanbaru. Data collected by direct observation and field interviews using questionnaires. The data obtained were then mapped using GIS (Geographic Information System). The results obtained showed that minor damage by 60% and were 40% moderate damage. Economic losses termites attacked against the State Elementary School building is Rp334.130.000 for tembesu wood standard and Rp246.367.000 for meranti wood standard. Types of termites that attacked the Elementary School Buildings were Microtermes inspiratus for subterranean termites and Cryptotermes cynocephalus for dry wood termites

Addressing the multiplicity of solutions in optical lens design as a niching evolutionary algorithms computational challenge

Algorithms and the Foundations of Software technolog

Are Women Happier When Their Spouse is Teleworker?

© 2017 Springer Science+Business Media Dordrecht. This study explores the household production allocation and happiness of women when their spouse is teleworker using data from the British Household Panel Survey over the years 1991–2009. The study aims to answer whether the women spend additional time on housework and are happier when they or their partner is teleworker. Also, we explore whether are happier when they share the household–domestic production with their partners. Fixed effects estimates take place, and we consider a Bayesian Network framework and a directed acyclic graph for causal inference. The results show that women are more likely to state that the household allocation, such as cooking, cleaning, ironing and childcare is shared when their partner teleworks. Shopping is an exception which can be regarded as an outdoor activity while one partner may be mainly responsible for this chore. In addition, women are happier when they or their spouse is teleworker, and they report higher levels of happiness when the household production allocation is a shared process. This may indicate men teleworkers may contribute extra to the household production releasing a burden for the partners and improving their well-being

Computing by only observing

The paradigm of evolution/observation is based on the idea that a computing device can be obtained by combining a basic system and an observer that transforms the evolution of the basic system into a readable output. In this framework we investigate what can be computed by changing the observer but not the basic observed system. We consider grammars as basic systems combined with finite state automata as observers, watching either the sequence of sentential forms or the productions used by the grammar. It is possible to obtain computational completeness only varying the observer, without modifying the basic system, which is a fixed context-free grammar. © Springer-Verlag Berlin Heidelberg 2006